Efficient Broadcasting in Self-organizing Multi-hop Wireless Networks

نویسندگان

  • Nathalie Mitton
  • Eric Fleury
چکیده

Multi-hop wireless networks (such as ad-hoc or sensor networks) consist of sets of mobile nodes without the support of a pre-existing fixed infrastructure. For the purpose of scalability, ad-hoc and sensor networks may both need to be organized into clusters and require some protocols to perform common global communication patterns and particularly for broadcasting. In a broadcasting task, a source node needs to send the same message to all the nodes in the network. Some desirable properties of a scalable broadcasting are energy and bandwidth efficiency, i.e., message retransmissions should be minimized. In this paper, we propose to take advantage of the characteristics of a previous clustered structure to extend it to an efficient and scalable broadcasting structure. In this way, we build only one structure for both operations (organizing and broadcasting) by applying a distributed clustering algorithm. Our broadcasting improve the number of retransmissions as compared to existing solutions. keywords: multi-hop wireless networks, self-organization, broadcasting.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Broadcasting in Self-Organizing Sensor Networks

Multi-hop wireless networks (such as ad-hoc or sensor networks) consist in sets of mobile nodes without the support of a pre-existing fixed infrastructure. For scalability purpose, ad-hoc and sensor networks may both need to be organized into clusters and require efficient protocols to perform common global communication patterns like the broadcasting operation. During a broadcasting task, a so...

متن کامل

FRAGILE: Failure Resilience and Application Guaranteed Integrity in Large-scale Environments

We study consensus in a message-passing system where only some of the n2 links exhibit some synchrony. This problem was previously studied for systems with process crashes; we now consider byzantine failures. We show that consensus can be solved in a system where there is at least one non-faulty process whose links are eventually timely; all other links can be arbitrarily slow. We also show tha...

متن کامل

Neural Network Based Energy-Efficient Multi-hop Hierarchical Routing Protocol for Wireless Sensor Networks

This paper presents a new neural network based routing protocol for Wireless sensor networks called Energy efficient Multi-hop Hierarchical Routing protocol using Self organizing map (EMHRS). This new protocol has an innovative quality of service (QoS)-driven routing algorithm based on artificial intelligence that can select next hop cluster head using Self Organizing Map neural network capabil...

متن کامل

A Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks

Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...

متن کامل

A multi-hop PSO based localization algorithm for wireless sensor networks

A sensor network consists of a large number of sensor nodes that are distributed in a large geographic environment to collect data. Localization is one of the key issues in wireless sensor network researches because it is important to determine the location of an event. On the other side, finding the location of a wireless sensor node by the Global Positioning System (GPS) is not appropriate du...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005